Sharing memory with semi-byzantine clients and faulty storage serversATTIYA, Hagit; BAR-OR, Amir.Parallel processing letters. 2006, Vol 16, Num 4, pp 419-428, issn 0129-6264, 10 p.Article

Adaptive and efficient algorithms for lattice agreement and renamingATTIYA, Hagit; FOUREN, Arie.SIAM journal on computing (Print). 2002, Vol 31, Num 2, pp 642-664, issn 0097-5397Article

Time bounds for decision problems in the presence of timing uncertainty and failuresATTIYA, Hagit; DJERASSI-SHINTEL, Taly.Journal of parallel and distributed computing (Print). 2001, Vol 61, Num 8, pp 1096-1109, issn 0743-7315Article

LOWER BOUNDS FOR RANDOMIZED CONSENSUS UNDER A WEAK ADVERSARYATTIYA, Hagit; CENSOR-HILLEL, Keren.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3885-3904, issn 0097-5397, 20 p.Article

RANDOMIZATION DOES NOT REDUCE THE AVERAGE DELAY IN PARALLEL PACKET SWITCHESATTIYA, Hagit; HAY, David.SIAM journal on computing (Print). 2008, Vol 37, Num 5, pp 1613-1636, issn 0097-5397, 24 p.Article

Tight bounds for FEC-based reliable multicastATTIYA, Hagit; SHACHNAI, Hadas.Information and computation (Print). 2004, Vol 190, Num 2, pp 117-135, issn 0890-5401, 19 p.Article

Highly concurrent multi-word synchronizationATTIYA, Hagit; HILLEL, Eshcar.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1243-1262, issn 0304-3975, 20 p.Article

Tight Bounds for Asynchronous Randomized ConsensusATTIYA, Hagit; CENSOR, Keren.Journal of the Association for Computing Machinery. 2008, Vol 55, Num 5, issn 0004-5411, 20-20.26Article

The combinatorial structure of wait-free solvable tasksATTIYA, Hagit; RAJSBAUM, Sergio.SIAM journal on computing (Print). 2002, Vol 31, Num 4, pp 1286-1313, issn 0097-5397Article

Computing in totally anonymous asynchronous shared memory systemsATTIYA, Hagit; GORBACH, Alla; MORAN, Shlomo et al.Information and computation (Print). 2002, Vol 173, Num 2, pp 162-183, issn 0890-5401Article

Quantifying rollback propagation in distributed checkpointingAGBARIA, Adnan; ATTIYA, Hagit; FRIEDMAN, Roy et al.Journal of parallel and distributed computing (Print). 2004, Vol 64, Num 3, pp 370-384, issn 0743-7315, 15 p.Article

Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc NetworksATTIYA, Hagit; KOGAN, Alex; WELCH, Jennifer L et al.IEEE transactions on mobile computing. 2010, Vol 9, Num 3, pp 361-375, issn 1536-1233, 15 p.Article

Adapting to Point Contention with Long-Lived Safe Agreement (Extended Abstract)ATTIYA, Hagit.Lecture notes in computer science. 2006, pp 10-23, issn 0302-9743, isbn 3-540-35474-3, 1Vol, 14 p.Conference Paper

Polynomial and adaptive long-lived (2k-1)-renamingATTIYA, Hagit; FOUREN, Arie.Lecture notes in computer science. 2000, pp 149-163, issn 0302-9743, isbn 3-540-41143-7Conference Paper

Combining shared-coin algorithmsASPNES, James; ATTIYA, Hagit; CENSOR, Keren et al.Journal of parallel and distributed computing (Print). 2010, Vol 70, Num 3, pp 317-322, issn 0743-7315, 6 p.Article

Wait-free n-set consensus when inputs are restrictedATTIYA, Hagit; AVIDOR, Zvi.Lecture notes in computer science. 2002, pp 326-338, issn 0302-9743, isbn 3-540-00073-9, 13 p.Conference Paper

The complexity of updating snapshot objectsATTIYA, Hagit; ELLEN, Faith; FATOUROU, Panagiota et al.Journal of parallel and distributed computing (Print). 2011, Vol 71, Num 12, pp 1570-1577, issn 0743-7315, 8 p.Article

Built-in coloring for highly-concurrent doubly-linked listsATTIYA, Hagit; HILLEL, Eshcar.Lecture notes in computer science. 2006, pp 31-45, issn 0302-9743, isbn 3-540-44624-9, 1Vol, 15 p.Conference Paper

Transactional Contention Management as a Non-Clairvoyant Scheduling ProblemATTIYA, Hagit; EPSTEIN, Leah; SHACHNAI, Hadas et al.Algorithmica. 2010, Vol 57, Num 1, pp 44-61, issn 0178-4617, 18 p.Article

The Complexity of Obstruction-Free ImplementationsATTIYA, Hagit; GUERRAOUI, Rachid; HENDLER, Danny et al.Journal of the Association for Computing Machinery. 2009, Vol 56, Num 4, issn 0004-5411, 24.1-24.33Article

The complexity of updating multi-writer snapshot objectsATTIYA, Hagit; ELLEN, Faith; FATOUROU, Panagiota et al.Lecture notes in computer science. 2006, pp 319-330, issn 0302-9743, isbn 978-3-540-68139-7, 1Vol, 12 p.Conference Paper

Efficient adaptive collect using randomizationATTIYA, Hagit; KUHN, Fabian; WATTENHOFER, Mirjam et al.Lecture notes in computer science. 2004, pp 159-173, issn 0302-9743, isbn 3-540-23306-7, 15 p.Conference Paper

Optimal clock synchronization under energy constraints in wireless ad-hoc networksATTIYA, Hagit; HAY, David; WELCH, Jennifer L et al.Lecture notes in computer science. 2006, pp 221-234, issn 0302-9743, isbn 3-540-36321-1, 1Vol, 14 p.Conference Paper

The N-Burst/G/1 model with heavy-tailed service-times distributionNOSSENSON, Ronit; ATTIYA, Hagit.Proceedings - International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems. 2004, pp 131-138, issn 1526-7539, isbn 0-7695-2251-3, 1Vol, 8 p.Conference Paper

Transactional contention management as a non-clairvoyant scheduling problemATTIYA, Hagit; EPSTEIN, Leah; SHACHNAI, Hadas et al.ACM Symposium on Principles of Distributed Computing. 2006, pp 308-315, isbn 1-595-93384-0, 1Vol, 8 p.Conference Paper